A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Malarvizhi, J.
- A Study for Potential Identification used for any Academic Institutions
Authors
1 Bharathiar University, Marudhamalai Road, Coimbatore – 641046, Tamil Nadu, IN
2 Pannai College Of Engineering and Technology (PCET), Manamadurai Main Road, Sivagangai – 630561, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 10, No 11 (2017), Pagination:Abstract
Association’s data is the principle resource for any overseeing body. In light of every day operational activity, data will grow up. Data in extraordinary amount will be a problem in the metal on the off chance that they can’t use it appropriately. The application program s used for significantly and massively goliath data set are not quite the same as customary information distribution center as it contains non-value-based information. A considerable aggregate of information is amassed, which is should have been gotten to in slightest term when complex enquiry are executed in current state uses of information stockroom .For huge database , the association needs to take additional elbow oil to separate the central to prepare. In the event that information is not be used in right way, it is just be destroyed in that association. Keeping in mind the end goal to shun the dilemma, we may utilize data mining strategies. These are habituated to find valuable stone of outline s in the cosmic amount of information that has been caught in the unremarkable course of running the enterprises. When the information required for getting potential drop of educate in any employee mental foundation is contrasted and the other scholarly start information, testing yield the cluster of times for checking the kinfolk quality , connection between both the information. Subsequently there is a measure and summed up example expected to get to these information in lesser time. In this paper we have proposed to outline a summed up example for getting ideal use of info/yield apparatus on significantly and tremendously huge dataset solidly to get capability of educate in any scholastic establishment. Distinctive parameters are adjusted to think about the execution. The fundamental outline of this paper is to incontinence the objective to lessen plate I/O. For this imply, we have built up a winnow predicated application called ThaMalalgorithm to bunch the capability of understudies on their separate. The normal results of this paper will be the solid use of I/O inventions that are purchased in an exchange together.Keywords
Complex Queries, Generating the Support, Improvement in Disk I/O, New Algorithm, Pattern Matching, Parameter Settings, Synthetic Data, Scale-Up Experiments, Thrashing- Wireless Sensor Node Deployment for Multi Hop Directional Network using Fuzzy Selection Optimization Algorithm
Authors
1 Department of Computer Applications (MCA), Kongu Engineering College/Anna University, Perundurai-60, Erode, IN
Source
Wireless Communication, Vol 11, No 2 (2019), Pagination: 21-28Abstract
In this paper, the problem of deploying heterogeneous mobile sensors over a target area is addressed. Traditional approaches to mobile sensor deployment are specifically designed for homogeneous networks. Nevertheless, network and device homogeneity is an unrealistic assumption in most practical circumstances, and previous approaches fail when adopted in heterogeneous operative settings. For this reason, a generalization of the Voronoi-based approach which exploits the Laguerre geometry is introduced. The paper proves the appropriateness of the proposal to the optimization of heterogeneous networks. In addition, it demonstrates that it can be extended to deal with dynamically generated events or uneven energy depletion due to communications. Finally, by means of simulations, it shows that it provides a very stable sensor behavior, with fast and guaranteed termination and moderate energy consumption. It also shows that it performs better than its traditional counterpart and other methods based on virtual forces. In addition, this paper aims to identify optimal deployment locations of the given sensor nodes with a pre-specified sensing range, and to schedule them such that the network and coverage level. This paper uses fuzzy selection optimization algorithm for sensor deployment problem followed by an effective for scheduling. In addition, fuzzy selection optimization algorithm is used to provide maximum network lifetime utilization. The comparative study shows that fuzzy selection optimization algorithm performs better than other optimization algorithm for sensor deployment problem. The proposed fuzzy logic was capable to reach the simulation value in all the experimented cases.
Keywords
Sensor Network, Sensor Deployment, Voronoi Diagram, Fuzzy Selection Optimization, Optimization, Virtual Forces Algorithm.References
- BRORING, A. et al. New generation sensor web enablement. Sensors, 11, 2011, pp. 26522699. ISSN 1424-8220
- KUMAR, S. and SHEPHERD, D. Sensit: Sensor information technology for the warfighter. Proceedings of the 4th International Conference on Information Fusion (FUSION’01), 2011, pp. 3-9.
- CHONG, C.-Y. and KUMAR, S. P. Sensor networks: Evolution, opportunities, and challenges. Proceedings of the IEEE 91(8), 2013, pp. 1247-1256.
- Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., Anderson, J.: Wireless sensor networks for habitat monitoring. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pp. 88–97. ACM (2012)
- Sohraby, K., Minoli, D., Znati, T.: Wireless Sensor Networks: Technology, Protocols, and Applications. John Wiley and Sons Inc., New Jersey (2017)
- Yi Zou , Krishnendu Chakra and A. K. Pujari, “Sensor Deployment Using Virtual Force Algorithm in wireless sensor networks,” in Proc. Int. Conf. Describe. Compute. Network. 2018, pp. 325–330
- Yunxia Subgenus Chen and Y.-C. Tseng, “Sensor Placement for Maximizing Lifetime per Unit Cost in WSN,” in Proc. 2nd ACM Int. Conf. Wireless Sensor Network. Appl., 2016, pp. 115–121.
- P. Corked, C.-Y. Chong and S. Kumar, “Autonomous Deployment Using Unmanned Aerial Vehicle Robot: Evolution, opportunities, and challenges,” Proc. IEEE, vol. 91, no. 8, pp. 1247–1256, Aug. 2016.
- Krishnan Chakra D. Karaboga and B. Akay, “Grid Coverage for Surveillance in Distributed WSN and Algorithms simulating bee swarm intelligence,” Artif. Intel. Rev., vol. 31, nos. 1–4, pp. 61–85, 2015.
- Pankaj K. Agarwa D. Karaboga and B. Basturk, “Efficient Sensor Placement for Surveillance Problems of artificial bee colony (ABC) algorithm,” Appl. Soft Compute., vol. 8, pp. 687–697, Jan.2018.
- Jing LI, D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “Voronoi-Based Coverage Optimization algorithm and applications,” Artif. Intel. Rev., 2012, pp.1–37.
- D. Karaboga, S. Okdem, and C. Ozturk, “Cluster based wireless sensor network routing using artificial bee colony algorithm,” Wireless Netw. vol. 18, no. 7, pp. 847–860, 2012.
- G. Tan, S. Jarvis, and A.-M. Kenmare, “Connectivity-guaranteed and obstacle-adaptive deployment schemes for mobile sensor networks,” in Proc. 28th Int. Conf. Distribute. Computer. Syst., Jun. 2008, pp. 429–437.
- Habit Mostafaei, Mehdi Esnaashari, and Mohammad Reza Meybodi , “A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks” , Compute. Sci. Technol., vol. 26, no. 1, pp. 117–129, 2015.
- J. Wang, R. Gosh, and S. Das, “A survey on sensor localization,” J. Control Theory Appl., vol. 8, no. 1, pp. 2–11, 2012.
- S. Mini, S. K. Udgata, and S. L. Sabot, “A heuristic to maximize network lifetime for target coverage problem in wireless sensor networks,” Ad Hoc Sensor Wireless Netw., vol. 13, nos. 3–4, pp. 251–269, 2016.